Inverse problem on the Steiner Wiener index
نویسندگان
چکیده
منابع مشابه
Some remarks on inverse Wiener index problem
The sum of distances between all pairs of vertices W (G) in a connected graph G as a graph invariant was first introduced by Wiener [9] in 1947. He observed a correlation between boiling points of paraffins and this invariant, which has later become known as Wiener index of a graph. Today, the Wiener index is one of the most widely used descriptors in chemical graph theory. Due to its strong co...
متن کاملMolecular graphs and the inverse Wiener index problem
In the drug design process, one wants to construct chemical compounds with certain properties. In order to establish the mathematical basis for the connections between molecular structures and physicochemical properties of chemical compounds, some so-called structure-descriptors or ”topological indices” have been put forward. Among them, the Wiener index is one of the most important. A long sta...
متن کاملOn the Steiner hyper-Wiener index of a graph
For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...
متن کاملSteiner Wiener Index of Graph Products
The Wiener index W (G) of a connected graph G is defined as W (G) = ∑ u,v∈V (G) dG(u, v) where dG(u, v) is the distance between the vertices u and v of G. For S ⊆ V (G), the Steiner distance d(S) of the vertices of S is the minimum size of a connected subgraph of G whose vertex set is S. The k-th Steiner Wiener index SWk(G) of G is defined as SWk(G) = ∑ S⊆V (G) |S|=k d(S). We establish expressi...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2000